A Tight Lower Bound for Planar Steiner Orientation
نویسندگان
چکیده
منابع مشابه
The Tight Lower Bound for the Steiner Ratio in
A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of points in the ,metric space. In this note, we show that for any Minkowski plane, the Steiner rat...
متن کاملA Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA’01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edge-weighted tree TS on the vertex set S such that the distortion of the distances between vertices in S is small. His algorithm guarantees that for any finite tree, the distortion incurred is at most 8. Moreover, a family o...
متن کاملA Tight Lower Bound for Steiner Point Removal Problem on Trees
Gupta (SODA’01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edgeweighted tree TS on the vertex set S such that the distortion of the distances between vertices in S is small. His algorithm guarantees that for any finite tree, the distortion incurred is at most 8. Moreover, a family of...
متن کاملA Tight Lower Bound for Processor Coordination
We prove a tight lower bound on the running time of oblivious solutions to k set agreement In k set agreement processors start with input values from a given set and choose output values from the same set In every execution the set of output values must be contained in the set of input values and the set of output values must have size at most k A solution is oblivious if it does not make use o...
متن کاملA Tight Lower Bound for Streett Complementation
Finite automata on infinite words (ω-automata) proved to be a powerful weapon for mod-eling and reasoning infinite behaviors of reactive systems. Complementation of ω-automata iscrucial in many of these applications. But the problem is non-trivial; even after extensive studyduring the past two decades, we still have an important type of ω-automata, namely Streettautomata, for wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00580-x